Lecture 30: Np-hard Problems [fa'13] 30 Np-hard Problems 30.1 a Game You Can't Win
نویسندگان
چکیده
A salesman in a red suit who looks suspiciously like Tom Waits presents you with a black steel box with n binary switches on the front and a light bulb on the top. The salesman tells you that the state of the light bulb is controlled by a complex boolean circuit—a collection of AND, OR, and NOT gates connected by wires, with one input wire for each switch and a single output wire for the light bulb. He then asks you the following question: Is there a way to set the switches so that the light bulb turns on? If you can answer this question correctly, he will give you the box and a billion dollars; if you answer incorrectly, or if you die without answering at all, he will take your soul.
منابع مشابه
Lecture 29: Np-hard Problems [fa'13] 29 Np-hard Problems 29.1 a Game You Can't Win
A salesman in a red suit who looks suspiciously like Tom Waits presents you with a black steel box with n binary switches on the front and a light bulb on the top. The salesman tells you that the state of the light bulb is controlled by a complex boolean circuit—a collection of AND, OR, and NOT gates connected by wires, with one input wire for each switch and a single output wire for the light ...
متن کاملCS 261 : A Second Course in Algorithms Lecture # 15 : Introduction to Approximation Algorithms ∗
All of CS161 and the first half of CS261 focus on problems that can be solved in polynomial time. A sad fact is that many practically important and frequently occurring problems do not seem to be polynomial-time solvable, that is, are NP -hard. As an algorithm designer, what does it mean if a problem is NP -hard? After all, a real-world problem doesn’t just go away after you realize that it’s N...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملTheorem 1
In the last lecture, we studied the KNAPSACK problem. The KNAPSACK problem is an NP-hard problem but does admit a pseudo-polynomial time algorithm and can be solved efficiently if the input size is small. We used this pseudo-polynomial time algorithm to obtain an FPTAS for KNAPSACK. In this lecture, we study another class of problems, known as strongly NP-hard problems. Definition 1 (Strongly N...
متن کاملNetrunner Mate-in-1 or -2 is Weakly NP-Hard
We prove that deciding whether the Runner can win this turn (mate-in-1) in the Netrunner card game generalized to allow decks to contain an arbitrary number of copies of a card is weakly NP-hard. We also prove that deciding whether the Corp can win within two turns (mate-in-2) in this generalized Netrunner is weakly NP-hard.
متن کامل